Recursive Solutions of the Matrix Equations X + ATX − 1 A = Q and X − ATX − 1 A = Q

نویسنده

  • Nicholas Assimakis
چکیده

Abstract Two classes of recursive algorithms for computing the extreme solutions of the matrix equations X+AT X−1A = Q and X−AT X−1A = Q are presented. The Per Step Algorithms are based on the fixed point iteration method and its variations; the proposed Per Step Algorithm is an inversion free variant of the fixed point iteration method. The Doubling Algorithms are based on the cyclic reduction method and the Riccati equation solution method; the proposed Doubling Algorithm uses recursive solutions of the corresponding Riccati equations to solve any of the above matrix equations. Simulation results are given to illustrate the efficiency of the proposed algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Matrix Equation X+ATX-1A=Q and Its Application in Nano Research

The matrix equation X + ATX−1A = Q has been studied extensively when A and Q are real square matrices and Q is symmetric positive definite. The equation has positive definite solutions under suitable conditions, and in that case the solution of interest is the maximal positive definite solution. The same matrix equation plays an important role in Green’s function calculations in nano research, ...

متن کامل

Extremal Positive Solutions For The Distributed Order Fractional Hybrid Differential Equations

In this article, we prove the existence of extremal positive solution for the distributed order fractional hybrid differential equation$$int_{0}^{1}b(q)D^{q}[frac{x(t)}{f(t,x(t))}]dq=g(t,x(t)),$$using a fixed point theorem in the Banach algebras. This proof is given in two cases of the continuous and discontinuous function $g$, under the generalized Lipschitz and Caratheodory conditions.

متن کامل

Ranks of the common solution to some quaternion matrix equations with applications

We derive the formulas of the maximal andminimal ranks of four real matrices $X_{1},X_{2},X_{3}$ and $X_{4}$in common solution $X=X_{1}+X_{2}i+X_{3}j+X_{4}k$ to quaternionmatrix equations $A_{1}X=C_{1},XB_{2}=C_{2},A_{3}XB_{3}=C_{3}$. Asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. We give the exp...

متن کامل

Steffensen method for solving nonlinear matrix equation $X+A^T X^{(-1)}A=Q$

In this article we study Steffensen method to solve nonlinear matrix equation $X+A^T X^{(-1)}A=Q$, when $A$ is a normal matrix. We establish some conditions that generate a sequence of positive denite matrices which converges to solution of this equation.

متن کامل

Positive-additive functional equations in non-Archimedean $C^*$-‎algebras

‎Hensel [K‎. ‎Hensel‎, ‎Deutsch‎. ‎Math‎. ‎Verein‎, ‎{6} (1897), ‎83-88.] discovered the $p$-adic number as a‎ ‎number theoretical analogue of power series in complex analysis‎. ‎Fix ‎a prime number $p$‎. ‎for any nonzero rational number $x$‎, ‎there‎ ‎exists a unique integer $n_x inmathbb{Z}$ such that $x = ‎frac{a}{b}p^{n_x}$‎, ‎where $a$ and $b$ are integers not divisible by ‎$p$‎. ‎Then $|x...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008